Binary words with a given Diophantine exponent
نویسندگان
چکیده
منابع مشابه
Binary words with a given Diophantine exponent
We prove that every real number ξ > 1 is the Diophantine exponent of some binary word ω. More precisely, we show that Dio(ω) = ξ for ω = 101102103 · · · , where kn = [ξ] for ξ > 2, kn = [ν] with ν = (−ξ + 1 + √ 6ξ − 3ξ2 + 1)/(4− 2ξ) for 1 < ξ < 2, and kn = n for ξ = 1.
متن کاملDiophantine Equations Related with Linear Binary Recurrences
In this paper we find all solutions of four kinds of the Diophantine equations begin{equation*} ~x^{2}pm V_{t}xy-y^{2}pm x=0text{ and}~x^{2}pm V_{t}xy-y^{2}pm y=0, end{equation*}% for an odd number $t$, and, begin{equation*} ~x^{2}pm V_{t}xy+y^{2}-x=0text{ and}text{ }x^{2}pm V_{t}xy+y^{2}-y=0, end{equation*}% for an even number $t$, where $V_{n}$ is a generalized Lucas number. This pape...
متن کاملOn Minimal Words With Given Subword Complexity
We prove that the minimal length of a word Sn having the property that it contains exactly Fm+2 distinct subwords of length m for 1 ≤ m ≤ n is Fn + Fn+2. Here Fn is the nth Fibonacci number defined by F1 = F2 = 1 and Fn = Fn−1 + Fn−2 for n > 2. We also give an algorithm that generates a minimal word Sn for each n ≥ 1. 1991 Mathematics Subject Classification: Primary 68R15; Secondary 05C35. 0 In...
متن کاملBinary Words with Few Squares
A short proof is given for a result of Fraenkel and Simpson [Electronic J. Combinatorics 2 (1995), 159–164] stating that there exists an infinite binary word which has only three different squares u.
متن کاملCounting maximal-exponent factors in words
The topic of repeating segments in words is one of major interest in combinatorics on words. The topic has been studied for more than a century by many authors after the seminal work [9] which described infinite words containing no consecutive occurrences of the same factor. Beyond the theoretical aspect of questions related to redundancies in words, repetitions, also called repeats in the foll...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.08.013